Supporting Data mining of large databases by visual feedback queries

In this paper, we describe a query system that provides visual relevance feedback in querying large databases. Our goal is to support the process of data mining by representing as many data items as possible on the display. By arranging and coloring the data items as pixels according to their relevance for the query, the user gets a visual impression of the resulting data set. Using an interactive query interface, the user may change the query dynamically and receives immediate feedback by the visual representation of the resulting data set. Furthermore, by using multiple windows for different parts of a complex query, the user gets visual feedback for each part of the query and, therefore, may easier understand the overall result. Our system allows to represent the largest amount of data that can be visualized on current display technology, provides valuable feedback in querying the database, and allows the user to find results which, otherwise, would remain hidden in the database

Spin dependent fragmentation function at Belle

The measurement of the so far unknown chiral-odd quark transverse spin distribution in either semi-inclusive DIS (SIDIS) or inclusive measurements in pp collisions at RHIC has an additional chiral-odd fragmentation function appearing in the cross section. These chiral-odd fragmentation functions (FF) can for example be the so-called Collins FF or the Interference FF. HERMES has given a first hint that these FFs are nonzero, however in order to measure the transversity one needs these FFs to be precisely known. We have used 29.0 fb$^{-1}$ of data collected by the Belle experiment at the KEKB $e^+e^-$ collider to measure azimuthal asymmetries for different charge combinations of pion pairs and thus access the Collins FF.Comment: Results presented at the DIS 2006 conference in Tsukuba, Japa

Characterization and Commissioning of a Ka-Band Ground Station for Cognitive Algorithm Development

In 2018, the Cognitive Communications and Propagation projects completed installation and checkout testing of a new Ka-Band ground station at the NASA Glenn Research Center in Cleveland, Ohio. The Cognitive Algorithms Demonstration Testbed (CADeT) was developed to provide a fully characterized and controllable dynamic link environment to researchers looking to demonstrate hardware and software aligned with atmospheric sensing and cognitive algorithms. CADeT integrates a host of precision control and measurement systems in addition to repurposing a 5.5 meter beam-waveguide dish platform previously used with the Advanced Communications Technology Satellite (ACTS). This paper will discuss the laboratory testing of ground station components with a emphasis on elements vital to achieving link budget requirements including characterization of the new Gallium Nitride (GaN) Solid State Power Amplifier (SSPA) and far-field measurements of the new antenna feed. Finally, the paper discusses in-situ tests conducted with CADeT and the Tracking and Data Relay Satellite System (TDRSS) to validate laboratory results and make necessary link budget adjustments before reviewing the lessons learned

C-terminal fusion of eGFP to the bradykinin B-2 receptor strongly affects down-regulation but not receptor internalization or signaling

A functional comparison was made between the wildtype bradykinin B, receptor (B(2)wt) and the chimera B(2)eGFP (enhanced green-fluorescent protein fused to the C-terminus of B(2)Wt), both stably expressed in HEK 293 cells. There was almost no difference in terms of ligand-inducible receptor phosphorylation and internalization, signal transduction (accumulation of inositol phosphates) or expression and affinity. However, stimulation for up to 8 h with 10 mu M bradykinin (BK) resulted in a strong decrease in surface receptors (by 60% within 5 h) in B(2)Wt, but not in B(2)eGFP. When the expression levels of both constructs where comparably reduced using a weaker promoter, long-term stimulation resulted in a reduction in surface receptors for B(2)wt(low) to less than 20% within 1 h, whereas the chimera B(2)eGFP(low) still displayed 50% binding activity after 2 h. A 1-h incubation in the absence of BK resulted in a recovery of 60% of the binding in B(2)wt(low) after 1-h stimulation with BK, but of only 20% after 7-h stimulation. In contrast, B(2)eGFP(low) levels were restored to more than 70%, even after 7-h stimulation. These data indicate that although the fusion of eGFP to B(2)wt does not affect its ligand-induced internalization, it strongly reduces the down-regulation, most likely by promoting receptor recycling over degradation

Developmental changes in the weighting of prosodic cues

Previous research has shown that the weighting of, or attention to, acoustic cues at the level of the segment changes over the course of development (Nittrouer & Miller, 1997; Nittrouer, Manning & Meyer, 1993). In this paper we examined changes over the course of development in weighting of acoustic cues at the suprasegmental level. Specifically, we tested English-learning 4-month-olds’ performance on a clause segmentation task when each of three acoustic cues to clausal units was neutralized and contrasted it with performance on a Baseline condition where no cues were manipulated. Comparison with the reported performance of 6-month-olds on the same task (Seidl, 2007) reveals that 4-month-olds weight prosodic cues to clausal boundaries differently than 6-month-olds, relying more heavily on all three correlates of clausal boundaries (pause, pitch and vowel duration) than 6-month-olds do, who rely primarily on pitch. We interpret this as evidence that 4-month-olds use a holistic processing strategy, while 6-month-olds may already be able to attend separately to isolated cues in the input stream and may, furthermore, be able to exploit a language-specific cue weighting. Thus, in a way similar to that in other cognitive domains, infants begin as holistic auditory scene processors and are only later able to process individual auditory cues

Decidability of the Monadic Shallow Linear First-Order Fragment with Straight Dismatching Constraints

The monadic shallow linear Horn fragment is well-known to be decidable and has many application, e.g., in security protocol analysis, tree automata, or abstraction refinement. It was a long standing open problem how to extend the fragment to the non-Horn case, preserving decidability, that would, e.g., enable to express non-determinism in protocols. We prove decidability of the non-Horn monadic shallow linear fragment via ordered resolution further extended with dismatching constraints and discuss some applications of the new decidable fragment.Comment: 29 pages, long version of CADE-26 pape

Complexity of Equivalence and Learning for Multiplicity Tree Automata

We consider the complexity of equivalence and learning for multiplicity tree automata, i.e., weighted tree automata over a field. We first show that the equivalence problem is logspace equivalent to polynomial identity testing, the complexity of which is a longstanding open problem. Secondly, we derive lower bounds on the number of queries needed to learn multiplicity tree automata in Angluin's exact learning model, over both arbitrary and fixed fields. Habrard and Oncina (2006) give an exact learning algorithm for multiplicity tree automata, in which the number of queries is proportional to the size of the target automaton and the size of a largest counterexample, represented as a tree, that is returned by the Teacher. However, the smallest tree-counterexample may be exponential in the size of the target automaton. Thus the above algorithm does not run in time polynomial in the size of the target automaton, and has query complexity exponential in the lower bound. Assuming a Teacher that returns minimal DAG representations of counterexamples, we give a new exact learning algorithm whose query complexity is quadratic in the target automaton size, almost matching the lower bound, and improving the best previously-known algorithm by an exponential factor

At 11 months, prosody still outranks statistics

English-learning 7.5-month-olds are heavily biased to perceive stressed syllables as word onsets. By 11 months, however, infants begin segmenting non-initially stressed words from speech.Using the same artificial language methodology as Johnson and Jusczyk (2001), we explored the possibility that the emergence of this ability is linked to a decreased reliance on prosodic cues to word boundaries accompanied by an increased reliance on syllable distribution cues. In a baseline study, where only statistical cues to word boundaries were present, infants exhibited a familiarity preference for statistical words. When conflicting stress cues were added to the speech stream, infants exhibited a familiarity preference for stress as opposed to statistical words. This was interpreted as evidence that 11-month-olds weight stress cues to word boundaries more heavily than statistical cues. Experiment 2 further investigated these results with a language containing convergent cues to word boundaries. The results of Experiment 2 were not conclusive. A third experiment using new stimuli and a different experimental design supported the conclusion that 11-month-olds rely more heavily on prosodic than statistical cues to word boundaries. We conclude that the emergence of the ability to segment non-initially stressed words from speech is not likely to be tied to an increased reliance on syllable distribution cues relative to stress cues, but instead may emerge due to an increased reliance on and integration of a broad array of segmentation cues

Infant word segmentation revisited: Edge alignment facilitates target extraction

In a landmark study, Jusczyk and Aslin (1995) demonstrated that English-learning infants are able to segment words from continuous speech at 7.5 months of age. In the current study, we explored the possibility that infants segment words from the edges of utterances more readily than the middle of utterances. The same procedure was used as in Jusczyk and Aslin (1995); however, our stimuli were controlled for target word location and infants were given a shorter familiarization time to avoid ceiling effects. Infants were familiarized to one word that always occurred at the edge of an utterance (sentence-initial position for half of the infants and sentence-final position for the other half) and one word that always occurred in sentence-medial position. Our results demonstrate that infants segment words from the edges of an utterance more readily than from the middle of an utterance. In addition, infants segment words from utterance-final position just as readily as they segment words from utterance-initial position. Possible explanations for these results, as well as their implications for current models of the development of word segmentation, are discussed